constraint optimizationの例文

例文

1. Constraint optimization can be solved by branch and bound algorithms.
2. In some problems, often called " constraint optimization problems ", the objective function is actually the sum of cost functions, each of which penalizes the extent ( if any ) to which a soft constraint ( a constraint which is preferred but not required to be satisfied ) is violated.